Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
681	A HYPERCUBE PROBLEM Charles Pinter Mathematics Dept, Bucknell University, Lewisburg PA, [removed] Many problems of combinatorics are easy to state and difficult to solve. This paper concerns such a problem: Co Add to Reading List Source URL: ccc.ustc.edu.cn Language: English - Date: 2006-10-24 07:55:01 Mathematics Hypercube NP-complete problems Hypercube graph Graph theory Theoretical computer science Cubes
682	Algorithmica[removed]: 323–342 DOI[removed]s00453[removed]Computing Minimum Cuts by Randomized Search Heuristics Frank Neumann · Joachim Reichel · Add to Reading List Source URL: page.math.tu-berlin.de Language: English Combinatorial optimization Operations research Network flow NP-complete problems Minimum cut Maximum flow problem Flow network Cut Maximum cut Graph theory Mathematics Theoretical computer science
683	The Network Completion Problem: Inferring Missing Nodes and Edges in Networks Myunghwan Kim∗ Abstract While the social and information networks have become ubiquitous, the challenge of collecting complete network Add to Reading List Source URL: cs.stanford.edu Language: English - Date: 2012-02-24 13:41:09 Mathematics Statistical theory Expectation–maximization algorithm Missing data Maximum likelihood Random graph Degree distribution Statistics Estimation theory Graph theory
684	SATLIB: An Online Resource for Research on SAT Holger H. Hoos ([removed]) Department of Computer Science University of British Columbia Vancouver, Canada Add to Reading List Source URL: www.cs.ubc.ca Language: English - Date: 2001-08-31 14:15:31 NP-complete problems Logic in computer science Electronic design automation Formal methods Boolean algebra Boolean satisfiability problem Algorithm Satz Graph coloring Theoretical computer science Mathematics Applied mathematics
685	Chapter 8 Advertising on the Web One of the big surprises of the 21st century has been the ability of all sorts of interesting Web applications to support themselves through advertising, rather than subscription. While Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2014-04-06 12:34:36 Combinatorial optimization NP-complete problems Graph coloring Matching Greedy algorithm Online algorithm Algorithm Greedy coloring Edge coloring Mathematics Graph theory Theoretical computer science
686	Chapter 8 Advertising on the Web One of the big surprises of the 21st century has been the ability of all sorts of interesting Web applications to support themselves through advertising, rather than subscription. While Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2012-07-04 16:03:39 Combinatorial optimization NP-complete problems Graph coloring Matching Greedy algorithm Online algorithm Algorithm Greedy coloring Edge coloring Mathematics Graph theory Theoretical computer science
687	Choose Your Best Way Provided by TryEngineering.org - www.tryengineering.org Lesson Focus Lesson focuses on how mathematic models help to solve real problems and are realized in computers. Students work in teams to build Add to Reading List Source URL: www.tryengineering.org Language: English - Date: 2014-03-20 09:02:31 NP-complete problems Hamiltonian path Eulerian path Travelling salesman problem Graph Seven Bridges of Königsberg Distance Shortest path problem Petersen graph Graph theory Mathematics Theoretical computer science
688	1 Excercise[removed]Consider the complete graph K4 with four vertices; all vertices are connected by an edge to all other vertices. Suppose now we flip an unbiased coin for each Add to Reading List Source URL: www.trancethrust.nl Language: English - Date: 2012-05-06 05:29:24 Matroid theory Graph operations Graph Planar graphs Connectivity Edge coloring Pseudoforest Graph theory Mathematics Graph coloring
689	An update on the middle levels problem Ian Shields ∗ IBM, P.O. Box 12195, Research Triangle Park, North Carolina 27709, USA Brendan J. Shields Department of Physics, Massachusetts Institute of Technology, 77 Massachuse Add to Reading List Source URL: www.cybershields.com Language: English - Date: 2006-08-09 10:23:40 NP-complete problems Graph Tree Hamiltonian path Path decomposition Graph theory Theoretical computer science Mathematics
690	On the Existence of Hamiltonian Paths in the Cover Graph of M (n) Carla D. Savage ∗ Add to Reading List Source URL: www.cybershields.com Language: English - Date: 2004-06-03 00:55:16 Hamiltonian path Hypercube graph Petersen graph Handshaking lemma Graph theory Mathematics NP-complete problems

UPDATE